Some operations preserving the existence of kernels

نویسندگان

  • Mostafa Blidia
  • Pierre Duchet
  • Henry Jacob
  • Frédéric Maffray
  • Henry Meyniel
چکیده

We consider some classical constructions of graphs: join of two graphs, duplication of a vertex, and show that they behave nicely from the point of view of the existence of kernels. c © 1999 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topology Preserving Parallel 3D Thinning Algorithms

A widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26,6) binary pictures. The r...

متن کامل

Kernels and some operations in edge-coloured digraphs

Let D be an edge-coloured digraph, V (D) will denote the set of vertices of D; a set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following two conditions: For every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy -monochromatic direct...

متن کامل

Common fixed point results for graph preserving mappings in parametric $N_b$-metric spaces

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...

متن کامل

k-Kernels and some operations in digraphs

Let D be a digraph. V (D) denotes the set of vertices of D; a set N ⊆ V (D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u, v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy-directed path of length at most k − 1. In this...

متن کامل

Analysis of convergence of solution of general fuzzy integral equation with nonlinear fuzzy kernels

Fuzzy integral equations have a major role in the mathematics and applications.In this paper, general fuzzy integral equations with nonlinear fuzzykernels are introduced. The existence and uniqueness of their solutions areapproved and an upper bound for them are determined. Finally an algorithmis drawn to show theorems better.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 205  شماره 

صفحات  -

تاریخ انتشار 1999